منابع مشابه
Communicating by compatibility
A bio-inspired language is presented. Its terms are processes enclosed into boxes with typed interaction sites. The main feature of the formalism lays in the fact that the key-lock communication mechanism typically adopted by process calculi is partially relaxed in favour of a paradigm driven by a (parametric) notion of compatibility of interaction types. Two simple modelling examples are repor...
متن کاملCompatibility Checking for Asynchronously Communicating Software
Compatibility is a crucial problem that is encountered while constructing new software by reusing and composing existing components. A set of software components is called compatible if their composition preserves certain properties, such as deadlock freedom. However, checking compatibility for systems communicating asynchronously is an undecidable problem, and asynchronous communication is a c...
متن کاملOn Synchronous and Asynchronous Compatibility of Communicating Components
We study interacting components and their compatibility with respect to synchronous and asynchronous composition. The behavior of components is formalized by I/O-transition systems. Synchronous composition is based on simultaneous execution of shared output and input actions of two components while asynchronous composition uses unbounded FIFO-buffers for message transfer. In both contexts we st...
متن کاملCompatibility Properties of Synchronously and Asynchronously Communicating Components
We study interacting components and their compatibility with respect to synchronous and asynchronous composition. The behavior of components is formalized by I/O-transition systems. Synchronous composition is based on simultaneous execution of shared output and input actions of two components while asynchronous composition uses unbounded FIFO-buffers for message transfer. In both contexts we st...
متن کاملCompatibility Control of Asynchronous Communicating Systems with Unbounded Buffers
The composition of heterogeneous software components is required in many domains to build complex systems. However, such compositions raise mismatches between components such as unspecified messages. Checking compatibility for asynchronously communicating systems with unbounded channels is undecidable. In this paper, we propose a compatibility control approach based on a coverability product, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2008
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2007.09.001